Fully Homomorphic Encryption with Optimal Key Generation Secure Group Communication in Internet of Things Environment
نویسندگان
چکیده
The Internet of Things or “IoT” determines the highly interconnected network heterogeneous devices where each type communication seems to be possible, even unauthorized. Consequently, security requirement for these networks became crucial, while conventional protocol was identified as unusable in types networks, especially because some classes IoT with constrained resources. Secure group (SGC) environment is vital ensure confidentiality, integrity, and availability (CIA) data swapped within a collection devices. Typically, were resource-constrained limited memory, processing, energy, power, which makes SGC difficult task. This article designs Fully Homomorphic Encryption Optimal Key Generation Group Communication (FHEOKG-SGC) technique environment. presented FHEOKG-SGC mainly focuses on encryption routing securely via communication. To accomplish this, initially an FHE-based secure Next, keys FHE are chosen optimally using sine cosine algorithm (SCA). At same time, plum tree (PTA) applied identification routes network. Finally, employs trust model improve process, key management center used optimal handling keys. simulation analysis tested series experiments, outcomes studied under various measures. An extensive comparative study highlighted improvement over other recent approaches.
منابع مشابه
Efficient fully homomorphic encryption with circularly secure key switching process
Fully homomorphic encryption (FHE) has important applications in cloud computing. However, almost all fully homomorphic encryption schemes share two common flaws that they all use large-scale secret keys and some operations inefficient. In this paper, the “special b” variant of the Learning With Errors problem (bLWE) is presented, and helps us construct the first circularly secure key switching...
متن کاملSecure SURF with Fully Homomorphic Encryption
Cloud computing is an important part of today’s world because offloading computations is a method to reduce costs. In this paper, we investigate computing the Speeded Up Robust Features (SURF) using Fully Homomorphic Encryption (FHE). Performing SURF in FHE enables a method to offload the computations while maintaining security and privacy of the original data. In support of this research, we d...
متن کاملImproved Key Generation Algorithm for Gentry's Fully Homomorphic Encryption Scheme
Abstract. At EUROCRYPT 2011, Gentry and Halevi implemented a variant of Gentry’s fully homomorphic encryption scheme. The core part in their key generation is to generate an odd-determinant ideal lattice having a particular type of Hermite Normal Form. However, they did not give a rigorous proof for the correctness. We present a better key generation algorithm, improving their algorithm from tw...
متن کاملImproved Key Generation for Gentry's Fully Homomorphic Encryption Scheme
A key problem with the original implementation of the Gentry Fully Homomorphic Encryption scheme was the slow key generation process. Gentry and Halevi provided a fast technique for 2-power cyclotomic fields. We present an extension of the Gentry–Halevi key generation technique for arbitrary cyclotomic fields. Our new method is roughly twice as efficient as the previous best methods. Our estima...
متن کاملSecure Signal Processing Using Fully Homomorphic Encryption
This paper investigates the problem of performing signal processing via remote execution methods while maintaining the privacy of the data. Primary focus on this problem is a situation where there are two parties; a client with data or a signal that needs to be processed and a server with computational resources. Revealing the signal unencrypted causes a violation of privacy for the client. One...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2023
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app13106055